Embeddings Between Hypercubes and Hypertrees

Graph embedding problems have gained importance in the field of interconnection networks for parallel computer architectures. Interconnection networks provide an effective mechanism for exchanging data between processors in a parallel computing system. In this paper, we embed the rooted hypertree RHT (r) into r-dimensional hypercube Q with dilation 2, r ≥ 2. Also, we compute the exact wirelength of the embedding of the r-dimensional hypercube Q into the rooted hypertree RHT (r), r ≥ 2. Submitted: April 2014 Reviewed: May 2015 Revised: June 2015 Accepted: July 2015 Final: July 2015 Published: August 2015 Article type: Concise Paper Communicated by: A. Symvonis The work of R. Sundara Rajan is supported by Endeavour Research Fellowship, No. BR14003378, Australian Government, Australia. The work of Indra Rajasingh is supported by Project No. SR/S4/MS: 846/13, Department of Science and Technology, SERB, Government of India. E-mail addresses: [email protected] (R. Sundara Rajan) [email protected] (Paul Manuel) [email protected] (Indra Rajasingh) 362 R. Sundara Rajan et al. Embeddings Between Hypercubes and Hypertrees